Handling LTL Formulas in a Plan Graph
نویسندگان
چکیده
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملA Decision Procedure for a Fragment of Linear Time Mu-Calculus
In this paper, we study an expressive fragment, namely Gμ, of linear time μ-calculus as a highlevel goal specification language. We define Goal Progression Form (GPF) for Gμ formulas and show that every closed formula can be transformed into this form. Based on GPF, we present the notion of Goal Progression Form Graph (GPG) which can be used to describe models of a formula. Further, we propose ...
متن کاملThe Common Fragment of CTL and LTL
It is well-known that CTL and LTL have incomparable expressive power. In this paper, we give an inductive definition of those ACTL formulas that can be expressed in LTL. In addition, we obtain a procedure to decide whether an ACTL formula lies in LTL, and show that this problem is PSPACE complete. By omitting path quantifiers, we get an inductive definition of the LTL formulas expressible in AC...
متن کاملA Short Story of a Subtle Error in LTL Formulas Reduction and Divine Incorrectness
We identify a subtle error in LTL formulas reduction method used as one optimization step in an LTL to Büchi automata translation. The error led to some incorrect answers of the established model checker DiVinE. This paper should help authors of other model checkers to avoid this error. A translation of Linear Temporal Logic (LTL) formulas into language equivalent Büchi automata is an important...
متن کاملDistance-Based Topological Indices and Double graph
Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
متن کامل